A Formal Proof of the Deadline Driven Scheduler
نویسندگان
چکیده
منابع مشابه
Scheduling in the Situation Calculus : A Case
We illustrate the utility of the situation calculus for representing complex scheduling tasks by axiomatizing a deadline driven scheduler in the language. The actions arising in such a scheduler are examples of natural actions, as investigated in the concurrent situation calculus by Pinto 10], and later by Reiter 13]. Because the deadline driven scheduler is sequential, we must rst suitably mod...
متن کاملWorst case response time versus worst case offset configuration using the deadline driven scheduler
We study the worst case response in the scheduling of hard real-time periodic task sets with the deadline driven scheduler. We show that the worst case response times do not always occur in the synchronous schedule; even worse, the worst response times for the various tasks do not necessarily occur in the same asynchronous schedule.
متن کاملScheduling with message deadlines for hard real time SDL systems
Hard real–time system design requires both, a methodology that allows to control the increasing functional complexity and additionally an a–priori proof that all timing requirements will be met even in worst case situations. This work introduces a design heuristics based on the formal " Specification and Description Language " SDL aiming on the integration of a timeliness verification into an a...
متن کاملGlobal EDF-based scheduling with laxity-driven priority promotion
This paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for scheduling sporadic task systems on multiprocessors. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm. Each job is assigned a priority based on the well-known Global Earliest Deadline First (G-EDF) algorithm, as long as its laxity – the amount of time from the earliest possible time ...
متن کاملLibra: An Economy driven Job Scheduling System for Clusters
Clusters of computers have emerged as mainstream parallel and distributed platforms for highperformance, high-throughput and high-availability computing. To enable effective resource management on clusters, numerous cluster managements systems and schedulers have been designed. However, their focus has essentially been on maximizing CPU performance, but not on improving the value of utility del...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994